Copy Move Forgery Detection based on double matching

Copy Move is a technique widespreadly used in digital image tampering, meaning Copy Move Forgery Detection (CMFD) is still a significant research. In this paper, a novel CMFD method is proposed, including double matching process and region localizing process. In double matching process, the first matching is conducted on Delaunay triangles consisting of Local Intensity Order Pattern (LIOP) keypoints, to find the approximate location of suspicious regions. In order to find sufficient keypoint pairs, the existing set of matching triangles is expanded by adding their neighbors iteratively, covering the whole tampered regions, and the second matching with a looser threshold is conducted on the vertices. In the region localizing process, considering the case of multiple copies, Density-Based Spatial Clustering of Applications with Noise (DBSCAN) is used to classify the keypoint pairs described in a new model. Experimental results indicate that the proposed method, with good robustness, outperforms some state-of-the-art methods.     

混凝土结构的压电声波检测分析

本文介绍了混凝土结构的压电体波和表面波检测的主要进展,对两种压电声波检测的优缺点进行了总结。体波检测设备一般埋入混凝土内部,需要选择合理的检测部位,检测结果较为精确;声表面波检测无需选择特定的部位,但是检测深度有限。在实际检测工作过程中,可以联合两种方法相互验证。     

A Tradeoff Between Accuracy and Speed for K-Means Seed Determination

With a sharp increase in the information volume, analyzing and retrieving this vast data volume is much more essential than ever. One of the main techniques that would be beneficial in this regard is called the Clustering method. Clustering aims to classify objects so that all objects within a cluster have similar features while other objects in different clusters are as distinct as possible. One of the most widely used clustering algorithms with the well and approved performance in different applications is the k-means algorithm. The main problem of the k-means algorithm is its performance which can be directly affected by the selection in the primary clusters. Lack of attention to this crucial issue has consequences such as creating empty clusters and decreasing the convergence time. Besides, the selection of appropriate initial seeds can reduce the cluster’s inconsistency. In this paper, we present a new method to determine the initial seeds of the k-mean algorithm to improve the accuracy and decrease the number of iterations of the algorithm. For this purpose, a new method is proposed considering the average distance between objects to determine the initial seeds. Our method attempts to provide a proper tradeoff between the accuracy and speed of the clustering algorithm. The experimental results showed that our proposed approach outperforms the Chithra with 1.7% and 2.1% in terms of clustering accuracy for Wine and Abalone detection data, respectively. Furthermore, achieved results indicate that comparing with the Reverse Nearest Neighbor (RNN) search approach, the proposed method has a higher convergence speed.     

A robust locating multi-optima approach for damage identification of plate-like structures

This paper proposes a robust optimization approach for multiple damage identification of plate-like structures. Different from traditional particle swarm optimizations (PSOs), a combined PSO and niche technique (NPSO) is proposed to solve multimodal optimization problems, with the full consideration of subswarm creation, merging and absorbing mechanism. As a hypersensitive parameter to damage, the curvature mode shape is adopted to construct the objective function. Case studies are conducted to investigate the effectiveness and robustness of the algorithm on multi-damage identification. Simulation results show that the proposed algorithm exhibits robust search performance on identifying damage locations accurately with good convergence behavior. It is hoped that this study can provide guidance on robust damage detection, especially when the structure is subject to multiple damages and external disturbances.     

基于概要数据结构的全网络持续流检测方法

持续流是隐蔽的网络攻击过程中显现的一种重要特征，它不产生大量流量且在较长周期内有规律地发生，给传统的检测方法带来极大挑战。针对网络攻击的隐蔽性、单监测点的重负荷和信息有限的问题，提出全网络持续流检测方法。首先，设计一种概要数据结构，并将其部署在每个监测点；其次，当网络流到达监测点时，提取流的概要信息并更新概要数据结构的一位；然后，在测量周期结束时，主监测点将来自其他监测点的概要信息进行综合；最后，提出流持续性的近似估计，通过一些简单计算为每个流构建一个位向量，利用概率统计方法估计流持续性，使用修正后的持续性估计检测持续流。通过真实的网络流量进行实验，结果表明，与长持续时间流检测算法（TLF）相比，所提方法的准确性提高了50%，误报率和漏报率分别降低了22%和20%，说明全网络持续流检测方法能够有效监测高速网络流量。     

基于结构光的星箭对接环相对位姿测量方法

空间非合作目标位姿测量是空间在轨维护的前提。面向空间机械手对空间载体自动抓捕的应用需求，提出了基于结构光的空间非合作目标视觉测量方法。该方法以双套双线结构光测量装置作为测量传感器，以空间载体上普遍存在的星箭对接环作为抓捕目标。根据对接环的共同特点，选择直线特征和点特征相结合作为相对位姿的求解特征；基于直线特征求解圆环平面法向量，基于点特征求解圆环圆心坐标，进而得到机械手工具坐标系与对接环坐标系间的相对位姿关系；基于多重几何约束实现了不同光照条件下图像上目标直线的鲁棒识别。建立了演示验证实验系统，在大量演示实验的基础上，进行了实验结果分析。     

An integrated approach for aircraft turbofan engine fault detection based on data mining techniques

The present study proposes an algorithm for fault detection in terms of condition‐based maintenance with data mining techniques. The proposed algorithm is applied on an aircraft turbofan engine using flight data and consists of two main sections. In the first section, the relationship between engine exhaust gas temperature (EGT) as the main engine health monitoring criterion and other operational and environmental parameters of the engine was modelled using the data‐driven models. In the second section, a data set including EGT residuals, that is, the difference between the actual EGT of the system and the EGT estimated by the developed model in the health conditions of the engine, was created. Finally, faults occurring in each flight were detected based on the identification of abnormal events by a one‐class support vector machine trained by the health condition EGT residual data set. The results indicated that the proposed algorithm was an effective approach for inspecting aircraft engine conditions and detecting faults, with no need for technical knowledge on the interior characteristics of the aircraft engine.     

应用膨胀算法提取目标的直接定位算法

为了解决被动雷达系统中的多发射源定位问题，提出了一种基于多重信号分类(MUSIC)算法和图像膨胀(IE)算法的直接定位方法。该方法结合了谱分析中的MUSIC思想，通过对接收量测协方差矩阵进行特征分析求解目标的位置。首先，在目标个数未知的前提下，利用Akaike信息准则(AIC)来确定模型阶数；然后，推导了基于MUSIC的定位代价函数；之后，利用图像膨胀算法处理得到的代价函数平面；最后，膨胀处理后的输出为目标个数及目标位置的估计值。提出的算法有效地解决了目标检测及提取的问题，能够确定多个目标的位置坐标，为后续的定位性能分析提供可能性，也保证了算法的完整性。进一步地分析了多个临近目标情况下影响目标提取性能的主要因素。